The Subtree Max Gap Problem with Application to Parallel String Covering

An Optimal Algorithm for the Indirect Covering Subtree Problem

We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associated with a radius and a penalty. The goal is to locate a tree-shaped facility such that the sum of setup and penalty cost is minimized. The setup cost equals the sum of edge lengths taken by the facility and the penalty...

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

On the Budgeted Max-cut Problem and Its Application to the Capacitated Two-parallel Machine Scheduling

Dynamic Hub Covering Problem with Flexible Covering Radius

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

A Parallel Approach to Solve the Approximation String Matching Problem

m p p p P  2 1  and an error bound k, we are asked to find whether there exists a prefix of T whose edit distance with P is smaller than or equal to k. The edit dance between A and B is the minimum number of insertion, deletion and substitution operations needed to transform B into A[4]. This problem can be computed by using dynamic programming method [5, 14]. Many approximate string matching...